CHRIST (Deemed to University), Bangalore

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

School of Engineering and Technology

Syllabus for
Bachelor of Technology (Artificial Intelligence and Machine Learning)
Academic Year  (2023)

 
3 Semester - 2022 - Batch
Course Code
Course
Type
Hours Per
Week
Credits
Marks
AI331 MATHEMATICAL FOUNDATIONS FOR AI I Core Courses 3 3 100
AI332P PROGRAMMING TECHNIQUES FOR AI Core Courses 5 4 100
AI333P DIGITAL LOGIC AND COMPUTER ORGANIZATION Core Courses 5 4 100
AI334 ARTIFICIAL INTELLIGENCE Core Courses 3 3 100
AI335 SIGNALS AND SYSTEMS Core Courses 3 3 100
CY321 CYBER SECURITY Ability Enhancement Compulsory Courses 2 0 0
ECHO341CSP INTRODUCTION TO CRYPTOLOGY Minors and Honours 4 4 50
4 Semester - 2022 - Batch
Course Code
Course
Type
Hours Per
Week
Credits
Marks
AI431 MATHEMATICAL FOUNDATIONS FOR AI II - 3 3 100
AI432P MACHINE LEARNING - 5 4 100
AI433P DIGITAL SIGNAL PROCESSING - 5 4 100
AI434 SENSORS AND ROBOTICS - 3 3 100
AI435 DATA STRUCTURES AND ALGORITHMS - 5 4 100
BS451 ENGINEERING BIOLOGY LABORATORY - 2 2 50
ECHO441CS INTRODUCTION TO BLOCKCHAIN - 12 4 100
EVS421 ENVIRONMENTAL SCIENCE - 2 0 0
HS425 PROFESSIONAL ETHICS - 2 2 50

AI331 - MATHEMATICAL FOUNDATIONS FOR AI I (2022 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:3
Max Marks:100
Credits:3

Course Objectives/Course Description

 

The objective of this course is to describe the fundamental concepts of
linear algebra along with set theory, probability theory, random process, queuing theory to
support the graduate coursework and research

Course Outcome

CO-1: Understand the working of data in matrix form for solving systems of linear algebraic equations, for finding the basic matrix decompositions with the general understanding of their applicability.

CO-2: Understand the ability of matrices to better decompose a system model and represent it in orthogonal as well as in independent form along with finding approximate solutions to a given problem.

CO-3: Understand the basic probability concepts

CO-4: Describe standard distributions which can describe real life phenomena

CO-5: Understand set theory and the associated relation between different sets and their cardinality

Unit-1
Teaching Hours:9
LINEAR ALGEBRA-1
 

Introduction, Gaussian Elimination, Triangular Factors, Inverses and Transposes. Determinants, Properties & Applications of the Determinant.

Vector Spaces, Linear Independence, Basis and Dimension, Linear Transformations, Eigenvalues and Eigenvectors, Diagonalization of a Matrix.

Unit-2
Teaching Hours:9
LINEAR ALGEBRA-2
 

Block Matrices, Norms, Rank, Least Squares, Orthogonality, Gram-Schmidt, Matrix norms, SVD, SVD geometry and PCA 

Unit-3
Teaching Hours:9
PROBABILITY
 

Axioms of Probability, Conditional Probability, Total Probability, Baye‘s Theorem, Random variable, Probability mass function, Probability Density functions, Properties, Moments, Moment generating functions and their properties.

Unit-4
Teaching Hours:9
DISTRIBUTION & MULTIDIMENSIONAL RANDOM VARIABLE
 

Binomial, Poisson , Geometric, Negative binomial, Uniform, Exponential, Gamma, Weibull and normal distributions and their properties – Functions of Random Variables.

Multidimensional random variable: Joint distribution – Marginal and conditional distribution - Co-variance – Correlation and Regression – Transformation of Random Variables – Central Limit Theorem

Unit-5
Teaching Hours:9
FOUNDATIONS OF COMPUTING
 

Sets and Cantor's Theorem,  Mathematical Proof: Direct Proofs, Indirect Proofs,  Mathematical Induction, Functions and Cardinality: Functions, Injections, Surjections, and Bijections,  Transformations on Functions, Cardinality

Text Books And Reference Books:

1.  G. Strang, Linear algebra and its applications , Thomson Publications

2. S. Kumaresan, Linear algebra - A Geometric approach, Prentice Hall of India.

Essential Reading / Recommended Reading

1.  Jain, R.K. and Iyengar, S.R.K.; Advanced Engineering Mathematics; Narosa Publishers, 2005

 

2. E. Kreyszig, Advanced engineering mathematics , John Wiley publications.

Evaluation Pattern

CIA-50

ESE-100

AI332P - PROGRAMMING TECHNIQUES FOR AI (2022 Batch)

Total Teaching Hours for Semester:75
No of Lecture Hours/Week:5
Max Marks:100
Credits:4

Course Objectives/Course Description

 

To study  syntax, semantics, and the runtime environment of Python and R programming language. To be familiarized with universal computer programming concepts like data types, containers. To be familiarized with general computer programming concepts like conditional execution, loops & functionsSince R, is a popular statistical programming language students will learn data reading and its manipulation and be familiar with data analysis.

Course Outcome

Unit-1
Teaching Hours:9
INTRODUCTION TO PYTHON
 

Conceptual introduction: topics in computer science, algorithms; modern computer systems: hardware architecture, data representation in computers, software and operating system;

Python; basic syntax, interactive shell, editing, saving, and running a script, Data types, understanding error messages, Conditions, boolean logic, logical operators

Unit-2
Teaching Hours:9
STRINGS AND TEXT FILES
 

Manipulating files and directories, os and sys modules, reading/writing text and numbers from/to a file, creating and reading a formatted file (csv or tab-separated). String manipulations, slicing a string, strings and number system, Lists, tuples, and dictionaries

Unit-3
Teaching Hours:9
GRAPHICAL AND SEARCHING ALGORITHMS
 

Simple Graphics and Image Processing: “turtle” module; simple 2d drawing - colors, shapes; digital images, image file formats, image processing Simple image manipulations with 'image' module.

Searching, Sorting, and Complexity Analysis

Unit-4
Teaching Hours:9
INTRODUCTION TO R
 

Basic syntax -R, Datatypes in -R, Vectors, Lists, Matrices, ArraysFactors, Data Frames in -R,  Variables -Variable Assignment -Data Type of a Variable Finding Variables -Deleting Variables,

R– operators, decision making in -R, R– function: Definition, Function Components, Built-in Function, User-defined Function, Calling a Function

Unit-5
Teaching Hours:9
LISTS AND FRAMES
 

Lists, R– matrices, R– factors, -Factors in Data Frame, Changing the Order of Levels, Generating Factor Levels, R – data frames.

Common Functions Used with Factors- The tapply() Function - The split() Function -The by() Function - Working with Tables.

Text Books And Reference Books:

1.  Kenneth A. Lambert, The Fundamentals of Python: First Programs, 2011, Cengage Learning

2. Beginning Python Wrox Publication Peter Norton, Alex Samuel

3. Cotton, R., Learning R: a step by step function guide to data analysis. 1st edition. O’reilly Media Inc.

T4. Gardener, M.(2017). Beginning R: The statistical programming language, WILEY.

Essential Reading / Recommended Reading

1.  The Python Tutorial (https://docs.python.org/3/tutorial/): This is the official tutorial from the Python website.

2.  Lawrence, M., & Verzani, J. (2016). Programming Graphical User Interfaces in R. CRC press. (ebook)

Evaluation Pattern

CIA-70

ESE-30

AI333P - DIGITAL LOGIC AND COMPUTER ORGANIZATION (2022 Batch)

Total Teaching Hours for Semester:75
No of Lecture Hours/Week:5
Max Marks:100
Credits:4

Course Objectives/Course Description

 

To study the basics of digital circuits and learn methods and fundamental concepts used in the design of digital systems as well as   the basic structure of a digital computer and to study in detail the organization of the Control unit, the Arithmetic and Logical unit, Memory unit

Course Outcome

Unit-1
Teaching Hours:9
COMBINATIONAL CIRCUITS
 

Design procedure – Four variable Karnaugh Maps, Adders-Subtractors – Serial adder/Subtractor - Parallel adder/ Subtractor- Carry look ahead adder- BCD adder, Magnitude Comparator. Multiplexer/ Demultiplexer,Encoder / decoder, parity checker, Code converters. Implementation of combinational logic using MUX, ROM, PAL and PLA

Unit-2
Teaching Hours:9
SEQUENTIAL CIRCUITS
 

Classification of sequential circuits, Moore and Mealy -Design of Synchronous counters: state diagram- State table –State minimization –State assignment- ASM-Excitation table and maps-Circuit implementation - Universal shift register – Shift counters – Ring counters

Unit-3
Teaching Hours:9
ASYNCHRONOUS SEQUENTIAL CIRCUITS
 

Design of fundamental mode and pulse mode circuits – primitive state / flow table – Minimization of primitive state table –state assignment – Excitation table – Excitation map- cycles – Races, Hazards: Static –Dynamic –Essential –Hazards elimination

Unit-4
Teaching Hours:9
STRUCTURE OF COMPUTERS
 

History of computers, Von Neumann Architecture, Harvard architecture, Computer Components, Functional units - Basic operational concepts - Bus structures - Software performance – Memory locations and addresses-Addition and subtraction of signed numbers – Design of fast adders – Multiplication of positive numbers - Hardware Implementation- Signed operand multiplication.

Unit-5
Teaching Hours:9
ARITHMETIC & LOGIC UNIT
 

Booths Algorithm- fast multiplication – Integer division & it’s Hardware Implementation – Restoring and Non Restoring algorithms-Fundamental concepts – Execution of a complete instruction – Multiple bus organization – Hardwired control – Micro-programmed control - Pipelining – Basic concepts – Data hazards – operand forwarding-Instruction hazards- Instruction Set architecture for logical operation

Text Books And Reference Books:

1.  M. Morris Mano, Michael D. Ciletti, “Digital Design” 5thEdition, Prentice Hall of India Pvt. Ltd., New Delhi, 2015/Pearson Education (Singapore) Pvt. Ltd., New Delhi, 2003.

2. John .M Yarbrough,” Digital Logic Applications and Design”, Thomson- Vikas Publishing house, New Delhi, 2006.

3. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, 7th Edition “Computer Organization”, McGraw-Hill, 2011

Essential Reading / Recommended Reading

1.  S. Salivahanan and S. Arivazhagan, “Digital Circuits and Design”, 5th ed., Vikas Publishing House Pvt. Ltd, New Delhi, 2016.

2. Lawrence, M., & Verzani, J. (2016). Programming Graphical User Interfaces in R. CRC press. (ebook)

3. William Stallings, “Computer Organization and Architecture – Designing for Performance”, 10h Edition, Pearson Education, 2015.

Evaluation Pattern

CIA-70

ESE-30

AI334 - ARTIFICIAL INTELLIGENCE (2022 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:3
Max Marks:100
Credits:3

Course Objectives/Course Description

 

This course aims to introduce artificial intelligence by knowledge representation using semantic networks and rules, concepts of logic in artificial intelligence, concepts of planning and learning with an introduction of the expert systems.  

Course Outcome

CO-1: Formulate an efficient problem space for a problem in artificial intelligence

CO-2: Select a suitable search algorithm for a problem and characterize its time and space complexities

CO-3: Understand the concepts of knowledge representation using an appropriate technique

CO-4: Apply AI techniques to solve problems of Game Playing, Expert Systems, Machine Learning and Natural Language Processing

CO-5: Explain expert systems based on architecture, roles and knowledge acquisition

Unit-1
Teaching Hours:9
INTRODUCTION
 

Introduction, History, Intelligent Systems, Foundations of AI, Sub areas of AI, Applications. Problem Solving – State-Space Search and Control Strategies: Introduction, General Problem Solving, Characteristics of Problem, Exhaustive Searches, Heuristic Search Techniques, Iterative-Deepening A*, Constraint Satisfaction. Game Playing, Bounded Look-ahead Strategy and use of Evaluation Functions, Alpha-Beta Pruning. 

Unit-2
Teaching Hours:9
KNOWLEDGE REPRESENTATION AND LOGIC
 

Logic Concepts and Logic Programming: Introduction, Propositional Calculus, Propositional Logic, Natural Deduction System, Axiomatic System, Semantic Tableau System in Propositional Logic, Resolution Refutation in Propositional Logic, Predicate Logic, Logic Programming. Knowledge Representation: Introduction, Approaches to Knowledge Representation, Knowledge Representation using Semantic Network, Extended Semantic Networks for KR, Representing Knowledge using rules – Rules based deduction system, Knowledge Representation using Frames

Unit-3
Teaching Hours:9
REASONING UNDER UNCERTAINTY
 

Introduction to uncertain knowledge review of probability – Baye’s Probabilistic inferences and Dempster Shafer theory –Heuristic methods – Symbolic reasoning under uncertainty- Statistical reasoning – Fuzzy reasoning – Temporal reasoning- Non monotonic reasoning.

Unit-4
Teaching Hours:9
PLANNING AND LEARNING
 

Planning - Introduction, Planning in situational calculus - Representation for planning – Partial order planning algorithm- Learning from examples- Discovery as learning – Learning by analogy – Explanation based learning – Genetic Algorithms

Unit-5
Teaching Hours:9
EXPERT SYTEMS
 

Expert Systems – Architecture Of Expert Systems, Roles Of Expert Systems – Knowledge Acquisition –Meta Knowledge, Heuristics. Typical Expert Systems – MYCIN, DART, XOON, Expert Systems Shells.

Text Books And Reference Books:

1. Saroj Kaushik. Artificial Intelligence. Cengage Learning. 2011

2. Patrick Henry Winston,” Artificial Intelligence”, Addison Wesley, Third edition, 2010

3. Kevin Night And Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, McGraw Hill- 2008

Essential Reading / Recommended Reading

1. George F Luger, Artificial Intelligence, Pearson Education, 6th edition,2009

2. Engene Charniak and Drew Mc Dermott,” Introduction to Artificial intelligence, Addison Wesley, 2009

3. Nils J. Nilsson,”Principles of Artificial Intelligence“, Narosa Publishing House, 2000

Evaluation Pattern

CIA-50

ESE-50

AI335 - SIGNALS AND SYSTEMS (2022 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:3
Max Marks:100
Credits:3

Course Objectives/Course Description

 

To understand  the fundamental concepts and principles of signals and systems. To demonstrate spectral analysis of continuous time periodic and aperiodic signals using  Fourier and Laplace methods. Study about the characterization of total response, impulse response and frequency response of continuous and digital systems. To interpret discrete time signal by Discrete Time Fourier transforms and Z transform.  To analyse and characterization of total response, impulse response and frequency response of linear time invariant systems.

Course Outcome

CO-1: Understand the relation among transfer function, convolution and the impulse response

CO-2: Understand the relationship between the stability and causality of systems and the region of convergence of their Laplace transforms

CO-3: Express periodic signals in terms of Fourier series and represent an arbitrary signal in terms of a Fourier transform.

CO-4: Apply the Z- transform of continuous-time and discrete-time signals for stability analysis

CO-5: Explain basics of signals and systems to find the response of LTI system using convolution

Unit-1
Teaching Hours:9
INTRODUCTION
 

Definition, types of signals and their representations: continuous-time/discrete-time, periodic/non-periodic, even/odd, energy/power, deterministic/ random, one dimensional/ multidimensional; commonly used signals (in continuous-time as well as in discrete-time): unit impulse, unit step, unit ramp (and their interrelationships), exponential, rectangular pulse, sinusoidal; operations on continuous-time and discrete-time signals (including transformations of independent variables)

Unit-2
Teaching Hours:9
FOURIER TRANSFORM
 

Definition, conditions of existence of FT, properties, magnitude and phase spectra, Some important FT theorems, Parseval’s theorem, Inverse FT, relation between LT and FT, Discrete time Fourier transform (DTFT), inverse DTFT, convergence, properties and theorems, Comparison between continuous time FT and DTFT. Sampling theorem

Unit-3
Teaching Hours:9
LAPLACE TRANSFORM
 

One-sided LT of some common signals, important theorems and properties of LT, inverse LT, solutions of differential equations using LT, Bilateral LT, Regions of convergence (ROC)

Unit-4
Teaching Hours:9
Z-TRANSFORM
 

One sided and Bilateral Z- transforms, ZT of some common signals, ROC, Properties and theorems, solution of difference equations using one-sided ZT, s- to z-plane mapping

Unit-5
Teaching Hours:9
LINEAR TIME INVARIANT SYSTEMS
 

Continuous Time Systems: Linear Time invariant Systems and their properties. Differential equation & Block diagram representation, Impulse response, Convolution integral, Frequency response (Transfer Function), Fourier transforms analysis. Discrete Time System: Difference equations, Block diagram representation, Impulse response, Convolution sum, MATLAB tutorials

 

Text Books And Reference Books:

1. P. Ramakrishna Rao, `Signal and Systems’ 2008 Ed., Tata McGraw Hill, New DelhIi.

2. Signals, Systems & Communications - B.P. Lathi, BS Publications, 2003

Essential Reading / Recommended Reading

1. Signals & Systems - Simon Haykin and Van Veen, Wiley, 2nd Edition

2. Principles of Linear Systems and Signals, BP Lathi, Oxford University Press, 2015

3. Fundamentals of Signals and Systems- Michel J. Robert, MGH International Edition, 2008

Evaluation Pattern

CIA-50

ESE-50

CY321 - CYBER SECURITY (2022 Batch)

Total Teaching Hours for Semester:30
No of Lecture Hours/Week:2
Max Marks:0
Credits:0

Course Objectives/Course Description

 

This mandatory course is aimed at providing a comprehensive overview of the different facets of Cyber Security.  In addition, the course will detail into specifics of Cyber Security with Cyber Laws both in Global and Indian Legal environments

Course Outcome

CO1: Describe the basic security fundamentals and cyber laws and legalities

CO2: Describe various cyber security vulnerabilities and threats such as virus, worms, online attacks, Dos and others.

CO3: Explain the regulations and acts to prevent cyber-attacks such as Risk assessment and security policy management.

CO4: Explain various vulnerability assessment and penetration testing tools.

CO5: Explain various protection methods to safeguard from cyber-attacks using technologies like cryptography and Intrusion prevention systems.

Unit-1
Teaching Hours:6
UNIT 1
 

Security Fundamentals-4 As Architecture Authentication Authorization Accountability, Social Media, Social Networking and Cyber Security.Cyber Laws, IT Act 2000-IT Act 2008-Laws for Cyber-Security, Comprehensive National Cyber-Security Initiative CNCI – Legalities

Unit-2
Teaching Hours:6
UNIT 2
 

Cyber Attack and Cyber Services Computer Virus – Computer Worms – Trojan horse.Vulnerabilities -  Phishing -  Online Attacks – Pharming - Phoarging  –  Cyber Attacks  -  Cyber Threats -  Zombie- stuxnet - Denial of Service Vulnerabilities  - Server Hardening-TCP/IP attack-SYN Flood

Unit-3
Teaching Hours:6
UNIT 3
 

Cyber Security Management Risk Management and Assessment - Risk Management Process - Threat Determination Process -Risk Assessment - Risk Management Lifecycle.Security Policy Management - Security Policies - Coverage Matrix Business Continuity Planning - DisasterTypes  -  Disaster Recovery Plan - Business Continuity Planning Process

Unit-4
Teaching Hours:6
UNIT 4
 

Vulnerability - Assessment and Tools: Vulnerability Testing - Penetration Testing Black box- white box.Architectural Integration:  Security Zones - Devicesviz Routers, Firewalls, DMZ. Configuration Management - Certification and Accreditation for Cyber-Security.

Unit-5
Teaching Hours:6
UNIT 5
 

Authentication and Cryptography: Authentication - Cryptosystems - Certificate Services, Securing Communications:  Securing Services -  Transport  –  Wireless  -  Steganography and NTFS Data Streams. Intrusion Detection and Prevention Systems:   Intrusion -  Defense in Depth  -  IDS/IPS  -IDS/IPS Weakness and Forensic AnalysisCyber Evolution: Cyber Organization – Cyber Future

Text Books And Reference Books:

R1. Matt Bishop, “Introduction to Computer Security”, Pearson, 6th impression, ISBN: 978-81-7758-425-7.

R2. Thomas R, Justin Peltier, John, “Information Security Fundamentals”, Auerbach Publications.

R3. AtulKahate, “Cryptography and Network Security”,  2nd Edition, Tata McGrawHill.2003

R4. Nina Godbole, SunitBelapure, “Cyber Security”, Wiley India 1st Edition 2011

R5. Jennifer L. Bayuk and Jason Healey and Paul Rohmeyer and Marcus Sachs, “Cyber Security Policy Guidebook”, Wiley; 1 edition , 2012

R6. Dan Shoemaker and Wm. Arthur Conklin, “Cyber security: The Essential Body Of Knowledge”,   Delmar Cengage Learning; 1 edition, 2011

R7. Stallings, “Cryptography & Network Security - Principles & Practice”, Prentice Hall, 6th Edition 2014

Essential Reading / Recommended Reading

NIL

Evaluation Pattern

Only CIA will be conducted as per the University norms. No ESE

Maximum Marks : 50

ECHO341CSP - INTRODUCTION TO CRYPTOLOGY (2022 Batch)

Total Teaching Hours for Semester:60
No of Lecture Hours/Week:4
Max Marks:50
Credits:4

Course Objectives/Course Description

 

Identify, formulate, research literature, and analyse complex engineering

problems reaching substantiated conclusions using first principles of mathematics, natural

sciences, and engineering sciences.

Course Outcome

CO-1: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialisation for the solution of complex engineering problems.

Unit-1
Teaching Hours:9
Basic Concepts of Number Theory and Finite Fields:
 

Divisibility and the divisibility algorithm, Euclidean algorithm, Modular arithmetic, Groups, Rings and Fields, Finite fields of the form GF(p), Polynomial arithmetic, Finite fields of the form GF(2n), Galois group of a field extensions, Fixed field and Galois extensions, Fundamental theorem of Galois Theory

Unit-2
Teaching Hours:9
Classical Encryption Techniques
 

Symmetric cipher model, Substitution techniques, Transposition techniques, Steganography, Traditional Block Cipher structure, Data Encryption Standard (DES) 

Unit-3
Teaching Hours:9
Pseudo-Random-Sequence Generators
 

The AES Cipher, Linear Congruential Generators, Linear Feedback Shift Registers, Design and analysis of stream ciphers, Stream ciphers using LFSRs 

Unit-4
Teaching Hours:9
Principles of Public-Key Cryptosystems
 

Prime Numbers, Fermat‘s and Euler‘s theorem, Primality testing, Chinese Remainder theorem, discrete logarithm, The RSA algorithm, Diffie - Hellman Key Exchange, Elliptic Curve Arithmetic, Elliptic Curve Cryptography

Unit-5
Teaching Hours:9
One-Way Hash Functions
 

Background, Snefru, N-Hash, MD4, MD5, Secure Hash Algorithm [SHA],One way hash functions using symmetric block algorithms, Using public key algorithms, Choosing a one-way hash functions, Message Authentication Codes. Digital Signature Algorithm, Discrete Logarithm Signature Scheme

Text Books And Reference Books:

 

  1. Behrouz A. Forouzan and D. Mukhopadhyay, Cryptography & Network Security, McGraw Hill, New Delhi.
  2. William Stallings, Cryptography and Network Security: Principles and Practice, Prentice-Hall
Essential Reading / Recommended Reading

Cryptography and Network Security, Atul Kahate, TMH, 2003.

Evaluation Pattern

CIA- 50

ESE-50

AI431 - MATHEMATICAL FOUNDATIONS FOR AI II (2022 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:3
Max Marks:100
Credits:3

Course Objectives/Course Description

 

To understand the basics of multivariate calculus and to define an objective function and constraint functions in terms of design variables, and then state the optimization problem without and with constraints. To explain graph theory and the associated  algorithms for  graph colouring and trees 

Course Outcome

CO-1: Discuss the concepts of multivariable calculus

CO-2: Understand the concept of convexity, objective function, maxima and minima

CO-3: Study the fundamentals of optimization theory

CO-4: Understand the basics of graph theory and colouring rules

CO-5: Study the different algorithms for optimizing graphs and classes

Unit-1
Teaching Hours:9
MULTIVARIATE CALCULUS
 

Functions, Scalar derivative, rules of differentiation, partial derivatives, Gradient, directional derivative. Vector and matrix calculus: How to find derivative of {scalar-valued, vector- valued} function with respect to a {scalar, vector}

Unit-2
Teaching Hours:9
OPTIMISATION - I
 

Objective function, Constraints and Constraint surface; Formulation of design problems as mathematical programming problems. Classification of optimization problems Optimization using Calculus: Convexity and concavity of functions of one and two

variables, local/global maxima and minima, saddle point, Gradient vectors, Lagrangian function, KKT method.

Unit-3
Teaching Hours:9
OPTIMISATION - II
 

Standard form of linear programming (LP) problem- Graphical method, Simplex method, Duality and primal. Methods of line search, Global convergence theorem, Steepest descent method.

Quasi-Newton methods: DFP/ BFGS/ Broyden family. Quadratic Programming.

Unit-4
Teaching Hours:9
GRAPH THEORY - I
 

Graph Theory: Graph Terminology and Special Types of Graphs, Planar Graphs, Graph Coloring, Trees, Graph Minor. Vertex cover, matching, path cover, connectivity, edge coloring, vertex coloring, list coloring

Unit-5
Teaching Hours:9
GRAPH THEORY - II
 

Planarity, Perfect graphs; other special classes of Graphs Connectivity, Euler-Fleury’s Algorithm, Hierholzer’s algorithms and Hamilton Paths-Travelling salesman problem. Shortest path algorithm-Dijkstra’s algorithm.

Text Books And Reference Books:

 

1.  Gilbert Strang, Linear Algebra and its applications, 4th Ed, Cengage Learning, 2006

2.  MP Deisenroth, A A Faisal, C S Ong, Mathematics for Machine learning, Cambridge University, 2020

3.  Phil Dyke, Advanced Calculus, Macmillan International Higher Education, 1998

4.  Fletcher R., Practical Methods of Optimization, John Wiley, 2000

5.  Reinhard Diestel, "Graph Theory", Springer (2010)

Essential Reading / Recommended Reading

1.  Singiresu S Rao, Engineering Optimization, 4th ed, Wiley, 2009

2.  Jorge Nocedal and Stephen J. Wright: "Numerical Optimization", second ed,1999

Evaluation Pattern

CIA-50

ESE-100

AI432P - MACHINE LEARNING (2022 Batch)

Total Teaching Hours for Semester:75
No of Lecture Hours/Week:5
Max Marks:100
Credits:4

Course Objectives/Course Description

 

This course provides an introduction to basic skill set required in the fast expanding field of machine learning. Students will learn relevant basics in machine learning such as regression, clustering and classification. In addition, this course introduces advanced Python programming as a standard and common language for machine learning. This course is proposed to meet the growing business needs of individuals skilled in artificial intelligence, data analytics, statistical programming and other software skills. The proposed course will combine theory and practice to enable the student to gain the necessary knowledge to compete in the ever changing work environment

Course Outcome

Unit-1
Teaching Hours:9
INTRODUCTION
 

Types of machine learning, Designing Learning systems, Perspectives and Issues, Concept Learning, Version Spaces and Candidate Elimination Algorithm, Inductive bias.

Unit-2
Teaching Hours:9
CLASSIFICATION ALGORITHMS
 

Classification and Regression - Generalization, Overfitting, and Underfitting-Relation of Model Complexity to Dataset Size -Supervised Machine Learning Algorithms

Unit-3
Teaching Hours:9
INSTANT BASED LEARNING AND LEARNING SET OF RULES
 

K- Nearest Neighbour Learning, Locally Weighted Regression, Radial Basis Functions, Case-Based Reasoning.

Sequential Covering Algorithms, Learning Rule Sets, Learning First Order Rules, Learning Sets of First Order Rules.

Unit-4
Teaching Hours:9
BAYESIAN AND COMPUTATIONAL LEARNING
 

Bayes Theorem, Bayes Theorem Concept Learning, Maximum Likelihood, Minimum Description Length Principle, Bayes Optimal Classifier, Gibbs Algorithm, Naïve Bayes Classifier.

Unit-5
Teaching Hours:9
ANALYTICAL LEARNING AND REINFORCED LEARNING
 

Perfect Domain Theories, Explanation Based Learning, Inductive-Analytical Approaches, FOCL Algorithm, Reinforcement Learning.

 

Text Books And Reference Books:

1. Machine Learning. Tom Mitchell. First Edition, McGraw- Hill, 1997

Essential Reading / Recommended Reading

 

1. Introduction to Machine Learning Edition 2, by EthemAlpaydin

2. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012

R3. Christopher Bishop, “Pattern Recognition and Machine Learning” Springer, 2007

Evaluation Pattern

CIA-70

ESE-30

AI433P - DIGITAL SIGNAL PROCESSING (2022 Batch)

Total Teaching Hours for Semester:75
No of Lecture Hours/Week:5
Max Marks:100
Credits:4

Course Objectives/Course Description

 
  • Analyze and Compute FFT of a discrete time signal.
  • Design the various FIR filter techniques.
  • Design the various IIR filter techniques.
  • Analyze the finite word length effects in signal processing.
  • Learn the fundamentals of digital signal processors.

Course Outcome

Unit-1
Teaching Hours:9
FAST FOURIER TRANSFORM AND CONVOLUTION
 

Introduction to DFT – Efficient computation of DFT- Properties of DFT – FFT algorithms – Radix-2 FFT algorithms – Decimation in Time – Decimation in Frequency algorithms –sectioned convolution- overlap add method- overlap save method.

Unit-2
Teaching Hours:9
FINITE IMPULSE RESPONSE DIGITAL FILTERS
 

Linear phase filters-Frequency response of linear phase FIR filters-Fourier series method of designing FIR filters-Windowing techniques for design of linear phase FIR filters: Rectangular- Hamming- Hanning -Blackman windows - Gibbs phenomenon –principle of frequency sampling technique- FIR Filter Realization-Direct form, Cascade ,Linear phase FIR realization.

Unit-3
Teaching Hours:9
INFINITE IMPULSE RESPONSE DIGITAL FILTERS
 

Review of design of analogue Butterworth and Chebyshev Filters- Design of IIR digital filters using impulse invariance technique –bilinear transformation – pre warping –Frequency transformation in digital domain – IIR Filter Realization - Direct form I, Direct form II, cascade and parallel

Unit-4
Teaching Hours:9
FINITE WORD LENGTH EFFECTS IN DIGITAL FILTERS
 

Binary fixed point and floating point number representations - Comparison- Quantization noise –truncation and rounding-derivation for quantization noise power – input quantization error-coefficient quantization error –limit cycle oscillations-dead band problems - Overflow error-signal scaling.

Unit-5
Teaching Hours:9
DIGITAL SIGNAL PROCESSOR
 

Introduction to DSP Architecture – Dedicated MAC unit - Features of C6X Processor - Internal Architecture - Functional Units and Operation - Addressing Modes

Text Books And Reference Books:

1. John G Proakis- Dimtris G Manolakis, Digital Signal Processing Principles-Algorithms and   Application, Pearson/PHI- 4th Edition, 2007

2. S. K. Mitra- “Digital Signal Processing- A Computer based approach”, TataMc-Graw-Hill, 2001, New Delhi.

3. B. Venkataramani & M.Bhaskar, Digital Signal Processor Architecture-Programming and Application, Tata Mc-GrawHill 2002

Essential Reading / Recommended Reading

 

1. Allan V.Openheim, Ronald W. Sehafer& John R. Buck-“Discrete Time Signal   Processing”, Third edition, Pearson/Prentice Hall,2014.

2. Johny R-Johnson: Introduction to Digital Signal Processing, Prentice-Hall- 1984

3. Emmanuel I Fetchor “Digital Signal Processing: A Practical Approach”, 2/E -Prentice Hall

4. Li Tan “ Digital Signal Processing” Elsevier-2008

5. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2006

Evaluation Pattern

CIA-50

ESE-100

AI434 - SENSORS AND ROBOTICS (2022 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:3
Max Marks:100
Credits:3

Course Objectives/Course Description

 

The objective of this course is to impart knowledge about the engineering aspects of robotics and their applications and understand about the different sensors used in robotics

Course Outcome

Unit-1
Teaching Hours:9
SENSORS
 

Sensor: Contact and Proximity, Position, Velocity, Force, Tactile etc.
Introduction to Cameras, Camera calibration, Geometry of Image formation, Euclidean/Similarity/Affine/Projective transformations, Vision applications in robotics

Unit-2
Teaching Hours:9
INTRODUCTION TO ROBOTICS
 

Robot anatomy - Definition, law of robotics. Types and components of a robot, Classification of robots, Kinematics systems; Definition of mechanisms and manipulators, Degrees of Freedom.

Unit-3
Teaching Hours:9
ROBOT KINEMATICS AND DYNAMICS
 

Kinematic Modelling: Translation and Rotation Representation, Coordinate transformation, DH parameters, Forward and inverse kinematics, Jacobian, Singularity, Statics Dynamic Modelling: Forward and inverse dynamics, Equations of motion using Euler-Lagrange formulation, Newton Euler formulation.

Unit-4
Teaching Hours:9
ROBOT ACTUATION SYSTEMS
 

Actuators: Electric, Hydraulic and Pneumatic; Transmission: Gears, Timing Belts and Bearings, Parameters for selection of actuators.

Unit-5
Teaching Hours:9
AI IN ROBOTICS
 

Applications in unmanned systems, defence, medical, industries, etc., Robotics and Automation for Industry 4.0, Robot safety and social robotics. 

Text Books And Reference Books:

1. Siegwart and Illah R. Nourbakhsh, “Introduction to Autonomous Mobile Robots”, MIT Press, 2004.

2. Thomas Braunl, “Embedded Robotics”, Second Edition, Springer, 2006.

3. Sensor & transducers, D. Patranabis, 2nd edition, PHI

Essential Reading / Recommended Reading

1. ISiciliano and Khatib, “Handbook of Robotics”, Springer, 2008.

2. Instrument transducers, H.K.P. Neubert, Oxford University press.

Evaluation Pattern

CIA-50

ESE-100

AI435 - DATA STRUCTURES AND ALGORITHMS (2022 Batch)

Total Teaching Hours for Semester:75
No of Lecture Hours/Week:5
Max Marks:100
Credits:4

Course Objectives/Course Description

 

 

This course is designed to make the students familiar with basic techniques of algorithm analysis, to understand concepts of searching and sorting techniques and to assess how the choice of data structures impacts the performance of a program.

Course Outcome

Unit-1
Teaching Hours:9
INTRODUCTION TO ALGORITHMS AND ANALYSIS
 

Fundamentals of algorithm analysis, Space and time complexity of an algorithm, Types of asymptotic notations and orders of growth, Algorithm efficiency – best case, worst case, average case, Analysis of non-recursive and recursive algorithms.

Unit-2
Teaching Hours:9
LINEAR DATA STRUCTURES
 

Array- 1D and 2D array, Stack - Applications of stack: Expression Evaluation - Conversion of Infix to postfix and prefix expression. Queue - Types of Queues: Circular Queue, Double Ended Queue (deQueue). List - Singly linked lists – Doubly linked lists - Circular linked lists, Applications -Polynomial Addition/Subtraction

Unit-3
Teaching Hours:9
SORTING AND SEARCH TECHNIQUES
 

Sorting Algorithms: Basic concepts, Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Shell Sort, Heap Sort, Merge Sort, External Sorting, Internal Sorting. Searching: Linear Search, Binary Search. 

Unit-4
Teaching Hours:9
TREES
 

Terminology, Binary Tree – Terminology and Properties, Tree Traversals, Expression Trees – Binary Search Trees – operations in BST – insertion, deletion, Searching. AVL Trees-Insertion, deletion and Rotation in AVL Trees 

Unit-5
Teaching Hours:9
GRAPHS & HASHING
 

Basic definition and Terminology – Representation of Graph – Graph Traversal: Breadth First Search (BFS), Depth First Search (DFS) - Minimum Spanning Tree: Prim's, Kruskal's- Single Source Shortest Path: Dijkstra’s Algorithm. Hashing: Introduction, open hashing-separate chaining, closed hashing - linear probing, quadratic probing, double hashing, random probing, rehashing

Text Books And Reference Books:

1. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to Algorithms , Third edition, MIT Press, 2009.

2. Ellis Horowitz, S. Sahni, Freed, “Fundamentals of Data Structures in C”,2nd edition,2015.

Essential Reading / Recommended Reading

1. Y. Langsam, M. J. Augenstein and A. M. Tanenbaum, ―Data Structures using C, Pearson Education Asia, 2004.

2. Seymour Lipschutz, Data Structures, Schaum's Outlines Series, Tata McGraw-Hill

3. Vishal Goyal, Lalit Goyal and Pawan Kumar, Simplified approach to Data Structures, Shroff publications and Distributors.

Evaluation Pattern

CIA- 50

ESE- 100

BS451 - ENGINEERING BIOLOGY LABORATORY (2022 Batch)

Total Teaching Hours for Semester:30
No of Lecture Hours/Week:2
Max Marks:50
Credits:2

Course Objectives/Course Description

 

Understanding and application of MATLAB and TINKERCAD for biological analysis which would results in better healthcare and any engineer, irrespective of the parent discipline (mechanical, electrical, civil, computer, electronics, etc.,) can use the disciplinary skills toward designing/improving biological systems. This course is designed to convey the essentials of human physiology.The course will introduce to the students the various fundamental concepts in MATLAB and TINKERCAD for numerical analysis and circuit design using arduino.

 

Course Outcome

CO1: Examine the various applications of bioengineering and using common tool boxes for analysing medical information.

Unit-1
Teaching Hours:30
LIST OF EXPERIMENTS
 

1.     Blood Pressure Measurement using Arduino

2.     Measuring HRV using the data from pulse measurement in Matlab.

3.     Measure heart rate and SPO2 with Arduino

4.     Measuring BMI, heart rate, SPO2, HRV using MATLAB and indicating health of person.

5.     Analyzing breast cancer, EEG, ECG and CT images using MATLAB from online data sources and detecting irregularties (arrhythmia, tumor, cancer, epilepsy).

6.     Analyzing force developed in muscles when performing any given task (to move servo motor and subsequently robotic arm).

7.     Measuring water content in given soil using temperature, pH using Arduino.

8.     IR thermal imaging to determine effect of mobile radiation.

9.     Synthesis of biopolymers from starch.

 

Text Books And Reference Books:

NIL

 

 

Essential Reading / Recommended Reading

 NIL

 

 

 

 

Evaluation Pattern

As per university norms

ECHO441CS - INTRODUCTION TO BLOCKCHAIN (2022 Batch)

Total Teaching Hours for Semester:60
No of Lecture Hours/Week:12
Max Marks:100
Credits:4

Course Objectives/Course Description

 

The students should be able to understand a broad overview of the essential concepts of blockchain technology.

Course Objectives: 

  1. Understanding the concepts and the various terminologies in blockchain. 
  2. Familiarizing the various types of algorithms used in distributed computing.
  3. Understanding the workings of blockchain and the mining process.
  4.  Analyzing the various applications of blockchain technologies.
  5. Analyzing the security and privacy issues in the blockchain.

Course Outcome

1: Explain the concepts of Distributed systems, and the fundamentals and types of blockchain

2: Illustrate the various techniques in distributed computing in connection with the crypto primitives

3: Infer the operation of blockchain, the various architectures and structures used in it and essential components in Blockchain 1.0

4: Illustrate the various applications of blockchain technologies and components of Blockchain 2.0

5: Analyse the security issues in blockchain technology

Unit-1
Teaching Hours:12
Introduction
 

Distributed DBMS – Limitations of Distributed DBMS, Introduction to Block chain – History, Definition, Distributed Ledger, Blockchain Categories – Public, Private, Consortium, Blockchain Network and Nodes, Peer-to-Peer Network, Mining Mechanism, Generic elements of Blockchain, Features of Blockchain, and Types of Blockchain

Unit-2
Teaching Hours:12
Basic Distributed Computing & Crypto primitives
 

Atomic Broadcast, Consensus, Byzantine Models of Fault tolerance Hash functions, Puzzle friendly Hash, Collison resistant hash, digital signatures, public key crypto, verifiable random functions, Zero-knowledge systems.

Unit-3
Teaching Hours:12
Blockchain 1.0
 

Operation of Bitcoin Blockchain, Blockchain Architecture – Block, Hash, Distributer P2P, Structure of Blockchain- Consensus mechanism: Proof of Work (PoW), Proof of Stake (PoS), Byzantine Fault Tolerance (BFT), Proof of Authority (PoA) and Proof of Elapsed Time (PoET)

Unit-4
Teaching Hours:12
Blockchain 2.0
 

Ethereum and Smart Contracts, The Turing Completeness of Smart Contract Languages and verification challenges, Using smart contracts to enforce legal contracts, comparing Bitcoin scripting vs. Ethereum Smart Contracts

 

Unit-5
Teaching Hours:12
Privacy, Security issues in Blockchain
 

 Pseudo-anonymity vs. anonymity, Zcash and Zk-SNARKS for anonymity preservation, attacks on Blockchains – such as Sybil attacks, selfish mining, 51% attacks - -advent of algorand, and Sharding based consensus algorithms to prevent these

 

Text Books And Reference Books:
  1. Imran Bashir, “Mastering Blockchain: Distributed Ledger Technology, decentralization, and smart contracts explained”, 2nd Edition, Packt Publishing Ltd, March 2018.
  2. Bellaj Badr, Richard Horrocks, Xun (Brian) Wu, “Blockchain By Example: A developer's guide to creating decentralized applications using Bitcoin, Ethereum, and Hyperledger”, Packt Publishing Limited, 2018. 
Essential Reading / Recommended Reading
  1. Andreas M. Antonopoulos , “Mastering Bitcoin: Unlocking Digital Cryptocurrencies”, O’Reilly Media Inc, 2015.
  2. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven Goldfeder, “Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction”, Princeton University Press, 2016.

 

Evaluation Pattern

Evaluation Pattern:

CIA-1 Evaluated out of

CIA-2 Evaluated out of

CIA-3 Evaluated out of

Total CIA Marks Reduced to

Attendance

ESE

ESE Reduced to

Total

20 Marks

50 Marks

20 Marks

45 Marks

5 Marks

100 Marks

50 Marks

100 Marks

EVS421 - ENVIRONMENTAL SCIENCE (2022 Batch)

Total Teaching Hours for Semester:30
No of Lecture Hours/Week:2
Max Marks:0
Credits:0

Course Objectives/Course Description

 

To understand the scope and importance of environmental science towards developing a conscious community for environmental issues, both at global and local scale.  

Course Outcome

CO1: Explain the components and concept of various ecosystems in the environment (L2, PO7)

CO2: Explain the necessity of natural resources management (L2, PO1, PO2 and PO7)

CO3: Relate the causes and impacts of environmental pollution (L4, PO1, PO2, and PO3, PO4)

CO4: Relate climate change/global atmospheric changes and adaptation (L4,PO7)

CO5: Appraise the role of technology and institutional mechanisms for environmental protection (L5, PO8)

Unit-1
Teaching Hours:6
Introduction
 

Environment and Eco systems – Definition, Scope and importance. Components of environment. Concept and Structure of eco systems. Material Cycles – Nitrogen, Carbon, Sulphur, Phosphorous, Oxygen. Energy Flow and classification of Eco systems.   

Unit-2
Teaching Hours:6
Natural Resources
 

Classification and importance- Forest, Water, Mineral, Food, Energy. Management of natural resources – challenges and methods. Sustainable development – Goals, Agriculture, Industries

Unit-3
Teaching Hours:6
Environmental Pollution
 

Causes and Impacts – Air pollution, Water pollution, Soil Pollution, Noise Pollution, Marine Pollution, Municipal Solid Wastes, Bio Medical and E-Waste. Solid Waste Management

Unit-4
Teaching Hours:6
Climate change/Global Atmospheric Change
 

Global Temperature, Greenhouse effect, global energy balance, Global warming potential, International Panel for Climate Change (IPCC) Emission scenarios, Oceans and climate change. Adaptation methods. Green Climate fund. Climate change related planning- small islands and coastal region. Impact on women, children, youths and marginalized communities

Unit-5
Teaching Hours:6
Environmental Protection
 

Technology, Modern Tools – GIS and  Remote Sensing,. Institutional Mechanisms - Environmental Acts and Regulations, Role of government, Legal aspects. Role of Nongovernmental Organizations (NGOs) , Environmental Education and Entrepreneurship

Text Books And Reference Books:

T1Kaushik A and Kaushik. C. P, “Perspectives in Environmental Studies”New Age International Publishers, New Delhi, 2018 [Unit: I, II, III and IV]

T2Asthana and Asthana, “A text Book of Environmental Studies”, S. Chand, New Delhi, Revised Edition, 2010 [Unit: I, II, III and V]

T3Nandini. N, Sunitha. N and Tandon. S, “environmental Studies” , Sapana, Bangalore,  June 2019 [Unit: I, II, III and IV]

T4R Rajagopalan, “Environmental Studies – From Crisis to Cure”, Oxford, Seventh University Press, 2017, [Unit: I, II, III and IV]

 

Essential Reading / Recommended Reading

R1.Miller. G. T and Spoolman. S. E, “Environmental Science”, CENAGE  Learning, New Delhi, 2015

R2.Masters, G andEla, W.P (2015), Introduction to environmental Engineering and Science, 3rd Edition. Pearson., New Delhi, 2013.

R3.Raman Sivakumar, “Principals of Environmental Science and Engineering”, Second Edition, Cengage learning Singapore, 2005.

R4.P. Meenakshi, “Elements of Environmental Science and Engineering”, Prentice Hall of India Private Limited, New Delhi, 2006.

R5.S.M. Prakash, “Environmental Studies”, Elite Publishers Mangalore, 2007

R6.ErachBharucha, “Textbook of Environmental Studies”, for UGC, University press, 2005.

R7. Dr. Pratiba Sing, Dr. AnoopSingh and Dr. PiyushMalaviya, “Textbook of Environmental and Ecology”, Acme Learning Pvt. Ltd. New Delhi.

Evaluation Pattern

No Evaluation

HS425 - PROFESSIONAL ETHICS (2022 Batch)

Total Teaching Hours for Semester:30
No of Lecture Hours/Week:2
Max Marks:50
Credits:2

Course Objectives/Course Description

 

(a) To understand the moral values that ought to guide the Engineering profession.

(b) To resolve the moral issues in the profession.

 

Course Outcome

CO1: Outline professional ethics and human values by realizing the holistic attributes.{L1}{PO6,PO8}

CO2: Specify the Engineering Professional Ethics to identify problems related to society, safety, health & legal aspects. {L1}{PO6,PO8}

CO3: Explain the importance of being ethical while using technology in the digital space. {L2}{PO8,PO12}

CO4: Understand the ethical principles and behaviors laid down by IEEE. {L2}{PO6,PO8,PO9,PO12}

CO5: Explain the Importance of ethical conduct to safeguard environment and its resources with respect to electronics engineering. {L1}{PO7,PO8}

Unit-1
Teaching Hours:6
INTRODUCTION TO ETHICS
 

Introduction to Profession, Engineering and Professionalism, Three types of Ethics / Morality , Positive and Negative faces of Engineering Ethics

Unit-2
Teaching Hours:6
RESPONSIBILITY IN ENGINEERING AND ENGINEERING ETHICS
 

Introduction, Engineering Standards, Blame – Responsibility and Causation, Liability, Design Standards.

Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy – Models of Professional Roles - theories about right action - Self-interest - customs and religion - uses of ethical theories.

 

Unit-3
Teaching Hours:6
SOCIAL AND VALUE DIMENSIONS IN TECHNOLOGY
 

Technology – The Promise and Perils, Computer Technology – Privacy and Social Policy, Ownership of Computer Software and public Policy, Engineering Responsibility in Democratic Deliberation on Technology Policy, The Social Embeddedness of Technology.

Unit-4
Teaching Hours:6
ELECTRONICS ENGINEERING ETHICS
 

Ethics in Electronics Engineering - IEEE Code of Ethics, Computer Ethics, Case Studies on ethical conflicts, Corporate Social Responsibility

Ethics in Electronics Business – HR, Marketing, Finance and Accounting, Production and Operation, Tendering and contracts, Ethical behaviour expected out of a electronic contractor

 

Unit-5
Teaching Hours:6
ETHICS AND ENVIRONMENT
 

Environment in Law and Court Decisions, Criteria for “Clean Environment”, E-Waste Management, ethical responsibility towards e-waste management, radiation effects on the society, ethical behaviour of the stakeholders running the communication business 

Text Books And Reference Books:

T1. Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw-Hill, New York 1996. 

T2.  Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New Delhi, 2004.

 

Essential Reading / Recommended Reading

R1. Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall, New Jersey, 2004 (Indian Reprint).

R2. Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics – Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian Reprint now available)

R3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi, 2003

R4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and Engineers”, Oxford University Press, Oxford, 2001.

 

Evaluation Pattern

Components of the CIA
CIA I : Subject Assignments / Online Tests : 10 marks
CIA II : Mid Semester Examination (Theory) : 25 marks
CIAIII:Quiz/Seminar/Case Studies/Project/Innovative Assignments/presentations
/publications : 10 marks
Attendance : 05 marks
Total : 50 marks
Mid Semester Examination (MSE) : Theory Papers:
The MSE is conducted for 50 marks of 2 hours duration.
Question paper pattern; Five out of Six questions have to be answered. Each question carries 10
marks
End Semester Examination (ESE):
The ESE is conducted for 50 marks of 2 hours duration.
The syllabus for the theory papers are divided into FIVE units and each unit carries equal weightage in terms of marks distribution.